| 翻訳と辞書 |
| Neil Immerman ： ウィキペディア英語版 |
Neil Immerman
Neil Immerman (24 November 1953, Manhasset, New York) is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst.〔(Faculty directory: Neil Immerman ), Computer Science Department, University of Massachusetts Amherst, retrieved 2010-01-23.〕 He is one of the key developers of descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory.
Professor Immerman is an editor of the ''SIAM Journal on Computing''〔(Editorial board ), ''SIAM Journal on Computing'', retrieved 2010-01-23.〕 and of ''Logical Methods in Computer Science''.〔(Editorial board ), ''Logical Methods in Computer Science'', retrieved 2010-01-23.〕 He received B.S. and M.S. degrees from Yale University in 1974 and his Ph.D. from Cornell University in 1980 under the supervision of Juris Hartmanis, a Turing award winner at Cornell.〔〔.〕 His book "Descriptive Complexity" appeared in 1999.〔Graduate Texts in Computer Science, Springer-Verlag, ISBN 978-0-387-98600-5.〕
Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science for proof of what is known as the Immerman–Szelepcsényi theorem, the result that nondeterministic space complexity classes are closed under complementation.〔(1995 Gödel Prize ), ACM SIGACT, retrieved 2010-01-23.〕 Immerman is an ACM Fellow〔(ACM Fellows Award / Neil Immerman ), Association for Computing Machinery, retrieved 2010-01-23.〕 and a Guggenheim Fellow.〔(Neil Immerman ), John Simon Guggenheim Memorial Foundation, retrieved 2010-01-23.〕
==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Neil Immerman」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|